A Path Information Caching and Aggregation Approach to Traffic Source Identification
نویسندگان
چکیده
Probabilistic packet marking (PPM) is a technique designed to identify packet traffic sources with low storage and processing overhead on network routers. In most previous PPM approaches, individual path messages carry only partial path information. These methods are susceptible to “path falsification” attacks, which greatly reduce their effectiveness. This work proposes a path-falsification-attack free PPM algorithm called Path Information Caching and Aggregation (PICA) that records paths of packet streams in fixlength path messages, thus eliminating the need of path reconstruction at the receiver end. Besides, by using a router’s forwarding table to decompose packet volume, this semi-stateful method is more accurate in traffic volume report. It also supports both a packet rate-based path message generation algorithm and a redundant path message suppression mechanism to further eliminate path messages with the same destination. Finally, PICA protects PICA routers from being attacked by faked path messages. We have performed a trace-driven simulation study on the proposed PICA algorithm and compared its effectiveness with IETF’s iTrace scheme by varying the sampling probability, the number of attack sources, and attack traffic rate. Compared to iTrace, the PICA algorithm reduces the total number of path messages required by a factor of more than 2, while reporting traffic volume more accurately.
منابع مشابه
Spatial modelling of railway noise propagation
In recent decades, population growth and progress of technology have shaped large and compact urban settlements. Existence of huge transportation systems and developed urban infrastructures are among the most important properties of modern cities. In spite of prompt transit and facilitated daily activities, development of transportation systems causes many problems, including traffic, air and n...
متن کاملInformation-Centric Networking: A Thorough Evaluation of Popularity-based Probabilistic On-path Caching
The original Internet architecture was conceived to establish a connection between two participants. However, Internet usage today is dominated by content distribution and retrieval that comes in contrast to the host-based communication model of the network infrastructure. Information-Centric Networking (ICN) provides an alternative to the traditional Internet architecture by focusing on conten...
متن کاملProviding explicit congestion control and multi-homing support for content-centric networking transport
Content-centric networking (CCN) adopts a receiver-driven, hop-by-hop transport approach that facilitates in-network caching, which in turn leads to multiple sources and multiple paths for transferring content. In such a case, keeping a single round trip time (RTT) estimator for a multi-path flow is insufficient as each path may experience different round trip times. To solve this problem, it h...
متن کاملPredictive Caching Strategy for On-Demand Routing Protocols in Wireless Ad Hoc Networks
Route caching strategy is important in on-demand routing protocols in wireless ad hoc networks. While high routing overhead usually has a significant performance impact in low bandwidth wireless networks, a good route caching strategy can reduce routing overheads by making use of the available route information more efficiently. In this paper, we first study the effects of two cache schemes, “l...
متن کاملImprovement of performance in MPLS domains by using caching and aggregation of CR-LSP
Constraint-based routing (CR-LDP) extends the features of MPLS Label Distribution Protocol (LDP) working in conjunction with a wide variety of QoS scenarios and services including IP differentiated services, integrated services, traffic engineering, Asynchronous Transfer Mode (ATM) service classes and frame relay. When a large number of CR-LSPs are required a lot of CR-LDP signalling is needed:...
متن کامل